High Performance GPU‐based Proximity Queries using Distance Fields
Identifieur interne : 004F47 ( Main/Exploration ); précédent : 004F46; suivant : 004F48High Performance GPU‐based Proximity Queries using Distance Fields
Auteurs : T. Morvan [Norvège] ; M. Reimers [Norvège] ; E. Samset [Norvège]Source :
- Computer Graphics Forum [ 0167-7055 ] ; 2008-12.
English descriptors
- KwdEn :
Abstract
Proximity queries such as closest point computation and collision detection have many applications in computer graphics, including computer animation, physics‐based modelling, augmented and virtual reality. We present efficient algorithms for proximity queries between a closed rigid object and an arbitrary, possibly deformable, polygonal mesh. Using graphics hardware to densely sample the distance field of the rigid object over the arbitrary mesh, we compute minimal proximity and collision response information on the graphics processing unit (GPU) using blending and depth buffering, as well as parallel reduction techniques, thus minimizing the readback bottleneck. Although limited to image‐space resolution, our algorithm provides high and steady performance when compared with other similar algorithms. Proximity queries between arbitrary meshes with hundreds of thousands of triangles and detailed distance fields of rigid objects are computed in a few milliseconds at high‐sampling resolution, even in situations with large overlap.
Url:
DOI: 10.1111/j.1467-8659.2008.01183.x
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 004033
- to stream Istex, to step Curation: 004033
- to stream Istex, to step Checkpoint: 001449
- to stream Main, to step Merge: 005068
- to stream Main, to step Curation: 004F47
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">High Performance GPU‐based Proximity Queries using Distance Fields</title><author><name sortKey="Morvan, T" sort="Morvan, T" uniqKey="Morvan T" first="T." last="Morvan">T. Morvan</name></author><author><name sortKey="Reimers, M" sort="Reimers, M" uniqKey="Reimers M" first="M." last="Reimers">M. Reimers</name></author><author><name sortKey="Samset, E" sort="Samset, E" uniqKey="Samset E" first="E." last="Samset">E. Samset</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:B8F2171A2D8C45B8209F4B8F9F365D8B5119CFBC</idno><date when="2008" year="2008">2008</date><idno type="doi">10.1111/j.1467-8659.2008.01183.x</idno><idno type="url">https://api.istex.fr/document/B8F2171A2D8C45B8209F4B8F9F365D8B5119CFBC/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">004033</idno><idno type="wicri:Area/Istex/Curation">004033</idno><idno type="wicri:Area/Istex/Checkpoint">001449</idno><idno type="wicri:doubleKey">0167-7055:2008:Morvan T:high:performance:gpu</idno><idno type="wicri:Area/Main/Merge">005068</idno><idno type="wicri:Area/Main/Curation">004F47</idno><idno type="wicri:Area/Main/Exploration">004F47</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">High Performance GPU‐based Proximity Queries using Distance Fields</title><author><name sortKey="Morvan, T" sort="Morvan, T" uniqKey="Morvan T" first="T." last="Morvan">T. Morvan</name><affiliation wicri:level="1"><country xml:lang="fr">Norvège</country><wicri:regionArea>Interventional Centre, Faculty of Medicine, University of Oslo</wicri:regionArea><wicri:noRegion>University of Oslo</wicri:noRegion></affiliation></author><author><name sortKey="Reimers, M" sort="Reimers, M" uniqKey="Reimers M" first="M." last="Reimers">M. Reimers</name><affiliation wicri:level="1"><country xml:lang="fr">Norvège</country><wicri:regionArea>Centre of Mathematics for Applications, University of Oslo</wicri:regionArea><wicri:noRegion>University of Oslo</wicri:noRegion></affiliation></author><author><name sortKey="Samset, E" sort="Samset, E" uniqKey="Samset E" first="E." last="Samset">E. Samset</name><affiliation wicri:level="1"><country xml:lang="fr">Norvège</country><wicri:regionArea>Interventional Centre, Faculty of Medicine, University of Oslo</wicri:regionArea><wicri:noRegion>University of Oslo</wicri:noRegion></affiliation><affiliation wicri:level="1"><country xml:lang="fr">Norvège</country><wicri:regionArea>Interventional Centre, Rikshospitalet Medical Centre</wicri:regionArea><wicri:noRegion>Rikshospitalet Medical Centre</wicri:noRegion></affiliation></author></analytic><monogr></monogr><series><title level="j">Computer Graphics Forum</title><idno type="ISSN">0167-7055</idno><idno type="eISSN">1467-8659</idno><imprint><publisher>Blackwell Publishing Ltd</publisher><pubPlace>Oxford, UK</pubPlace><date type="published" when="2008-12">2008-12</date><biblScope unit="volume">27</biblScope><biblScope unit="issue">8</biblScope><biblScope unit="page" from="2040">2040</biblScope><biblScope unit="page" to="2052">2052</biblScope></imprint><idno type="ISSN">0167-7055</idno></series><idno type="istex">B8F2171A2D8C45B8209F4B8F9F365D8B5119CFBC</idno><idno type="DOI">10.1111/j.1467-8659.2008.01183.x</idno><idno type="ArticleID">CGF1183</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0167-7055</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>GPU</term><term>I.3.5 [Computer Graphics]: Geometric Algorithms</term><term>I.3.7 [Computer Graphics]: Animation; virtual reality</term><term>collision detection</term><term>distance fields</term><term>proximity queries</term></keywords></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Proximity queries such as closest point computation and collision detection have many applications in computer graphics, including computer animation, physics‐based modelling, augmented and virtual reality. We present efficient algorithms for proximity queries between a closed rigid object and an arbitrary, possibly deformable, polygonal mesh. Using graphics hardware to densely sample the distance field of the rigid object over the arbitrary mesh, we compute minimal proximity and collision response information on the graphics processing unit (GPU) using blending and depth buffering, as well as parallel reduction techniques, thus minimizing the readback bottleneck. Although limited to image‐space resolution, our algorithm provides high and steady performance when compared with other similar algorithms. Proximity queries between arbitrary meshes with hundreds of thousands of triangles and detailed distance fields of rigid objects are computed in a few milliseconds at high‐sampling resolution, even in situations with large overlap.</div></front></TEI><affiliations><list><country><li>Norvège</li></country></list><tree><country name="Norvège"><noRegion><name sortKey="Morvan, T" sort="Morvan, T" uniqKey="Morvan T" first="T." last="Morvan">T. Morvan</name></noRegion><name sortKey="Reimers, M" sort="Reimers, M" uniqKey="Reimers M" first="M." last="Reimers">M. Reimers</name><name sortKey="Samset, E" sort="Samset, E" uniqKey="Samset E" first="E." last="Samset">E. Samset</name><name sortKey="Samset, E" sort="Samset, E" uniqKey="Samset E" first="E." last="Samset">E. Samset</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/HapticV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 004F47 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 004F47 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Ticri/CIDE
|area= HapticV1
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:B8F2171A2D8C45B8209F4B8F9F365D8B5119CFBC
|texte= High Performance GPU‐based Proximity Queries using Distance Fields
}}
| This area was generated with Dilib version V0.6.23. |  |